Coexistence Proof Using Chain of Timestamps for Multiple RFID Tags

نویسندگان

  • Chih-Chung Lin
  • Yuan-Cheng Lai
  • J. Doug Tygar
  • Chuan-Kai Yang
  • Chi-Lung Chiang
چکیده

How can a RFID (Radio Frequency Identification Devices) system prove that two or more RFID tags are in the same location? Previous researchers have proposed yoking-proof and grouping-proof techniques to address this problem – and when these turned out to be vulnerable to replay attacks, a new existence-proof technique was proposed. We critique this class of existence-proofs and show it has three problems: (a) a race condition when multiple readers are present; (b) a race condition when multiple tags are present; and (c) a problem determining the number of tags. We present two new proof techniques, a secure timestamp proof (secTS-proof) and a timestampchaining proof (chaining-proof) that avoid replay attacks and solve problems in previously proposed techniques.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Anonymous Coexistence Proofs for RFID Tags

In a world with RFID carriers everywhere, the coexistence proof of multiple RFID-tagged objects shown at the same time and the same place can become a very useful mechanism and be adopted in many application areas such as computer forensics, evi-dences in law, valuables security, and warning or notification systems, etc. In order to support the correctness of derived proofs, it is necessary to ...

متن کامل

An Enhanced Grouping Proof for Multiple RFID Readers and Tag Groups

RFID authentication on large numbers of tags or tag groups has attracted many researchers’ attention as an extension of initial one-or-two-tags scenarios. Due to demands of RFID application in supply chain, various proofs are proposed in the purpose of solving existing problems of grouping tags identification. However, it is proved that verifiers in these proofs are not aware of abnormal relati...

متن کامل

An Anonymous Offline RFID Grouping-Proof Protocol

As more and more items are tagged with RFID (Radio Frequency Identification) tags, grouping-proof technology is widely utilized to provide a coexistence evidence for a group of related items. Due to the wireless channel used in RFID systems, a security risk exists in the communication between the reader and tags. How to ensure the tag’s information security and to generate reliable grouping-pro...

متن کامل

A RFID yoking proof protocol to preserve an offline verification using the commitment disclosure

A RFID (Radio Frequency Identification) yokingproof provides a verification manner that a pair of RFID tags is scanned simultaneously by one reader device to guarantee the physical proximity of multiple objects. However, the previous studies provide the verification that requires the online verifier. The connectivity between a reader and a verifier limits the practicality of a yoking proof. In ...

متن کامل

A Novel Multilayered RFID Tagged Cargo Integrity Assurance Scheme

To minimize cargo theft during transport, mobile radio frequency identification (RFID) grouping proof methods are generally employed to ensure the integrity of entire cargo loads. However, conventional grouping proofs cannot simultaneously generate grouping proofs for a specific group of RFID tags. The most serious problem of these methods is that nonexistent tags are included in the grouping p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007